An inexact Levenberg-Marquardt method for large sparse nonlinear least squres
نویسندگان
چکیده
منابع مشابه
Inexact trust region method for large sparse nonlinear least squares
The main purpose of this paper is to show that linear least squares methods based on bidiagonalization, namely the LSQR algorithm, can be used for generation of trust region path. This property is a basis for an inexact trust region method which uses the LSQR algorithm for direction determination. This method is very efficient for large sparse nonlinear least squares as it is supported by numer...
متن کاملA Levenberg-Marquardt method for large nonlinear least squares problems with noisy functions and gradients
In this paper we consider large scale nonlinear least squares problems with noisy function and gradient and propose a Levenberg-Marquardt method for solving such problems. More precisely, we consider that the exact function to optimize is not available or its evaluation is computationally demanding, but that approximations of it are available at any prescribed accuracy level. The proposed metho...
متن کاملDamping–undamping strategies for the Levenberg–Marquardt nonlinear least-squares method
The speed of the Levenberg–Marquardt ~LM! nonlinear iterative least-squares method depends upon the choice of damping strategy when the fitted parameters are highly correlated. Additive damping with small damping increments and large damping decrements permits LM to efficiently solve difficult problems, including those that otherwise cause stagnation. © 1997 American Institute of Physics. @S089...
متن کاملModified Levenberg-Marquardt Method for Neural Networks Training
In this paper a modification on Levenberg-Marquardt algorithm for MLP neural network learning is proposed. The proposed algorithm has good convergence. This method reduces the amount of oscillation in learning procedure. An example is given to show usefulness of this method. Finally a simulation verifies the results of proposed method. Keywords—Levenberg-Marquardt, modification, neural network,...
متن کاملLevenberg-Marquardt Method for Mathematical Programs with Linearly Complementarity Constraints
In this paper, a new method for solving a mathematical programming problem with linearly complementarity constraints (MPLCC) is introduced, which applies the Levenberg-Marquardt (L-M) method to solve the B-stationary condition of original problem. Under the MPEC-LICQ, the proposed method is proved convergent to B-stationary point of MPLCC.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
سال: 1985
ISSN: 0334-2700,1839-4078
DOI: 10.1017/s0334270000004604